Dynamic Available Transfer Capability Evaluation by Interior Point Nonlinear Programming
نویسندگان
چکیده
منابع مشابه
Assessment of Dynamic Available Transfer Capability using FDR PSO Algorithm
The loads and wheeling transactions are varying very rapidly in the deregulated power market. Hence the power producers must respond quickly to those changes without affecting the system security and stability. This paper presents an application of Fitness Distance Ratio Particle Swarm Optimization (FDR PSO) algorithm to determine the optimal generation dispatch of power producers with dynamic ...
متن کاملInterior-point methods for nonconvex nonlinear programming: cubic regularization
In this paper, we present a barrier method for solving nonlinear programming problems. It employs a Levenberg-Marquardt perturbation to the Karush-Kuhn-Tucker (KKT) matrix to handle indefinite Hessians and a line search to obtain sufficient descent at each iteration. We show that the Levenberg-Marquardt perturbation is equivalent to replacing the Newton step by a cubic regularization step with ...
متن کاملMixed integer nonlinear programming using interior-point methods
In this paper, we outline a bilevel approach for solving mixed integer nonlinear programming problems. The approach combines a branch-and-bound algorithm in the outer iterations and an infeasible interior-point method in the inner iterations. We report on the details of the implementation, including the efficient pruning of the branch-and-bound tree via equilibrium constraints, warmstart strate...
متن کاملInterior point methods for large-scale nonlinear programming
In the contribution, we describe an algorithm for solving nonlinear nonconvex programming problems, which is based on the interior point approach. The main theoretical results concern direction determination and step-length selection. We split inequality constraints into active and inactive parts to overcome problems with instability. Inactive constraints are eliminated directly, while active c...
متن کاملAn interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an `2-penalty function. The PLPF is defined by a set of penalty parameters that correspond to break points of the PLPF and are updated at every iteration. The `2-penalty function, like traditional penalty functions for NLP, is defined b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Power and Energy
سال: 2003
ISSN: 0385-4213,1348-8147
DOI: 10.1541/ieejpes.123.1357